Is Evolutionary Computation Evolving Fast Enough?

Evolutionary Genomics of Fast Evolving Tunicates

Tunicates have been extensively studied because of their crucial phylogenetic location (the closest living relatives of vertebrates) and particular developmental plan. Recent genome efforts have disclosed that tunicates are also remarkable in their genome organization and molecular evolutionary patterns. Here, we review these latter aspects, comparing the similarities and specificities of two m...

On Expressiveness of Evolutionary Computation : Is ECAlgorithmic ?

Evolutionary Computation has been used traditionally for solution of hard optimization problems. In a general case, solutions found by evolutionary algorithms are satisscing given current resources and constraints, but not necessary optimal. Under some conditions evolutionary algorithms are guaranteed (in innnity) to nd an optimal solution. However, evolutionary techniques are helpful not only ...

Not fast enough?

Fast and Deterministic Computation of Fixation Probability in Evolutionary Graphs

In evolutionary graph theory biologists study the problem of determining the probability that a small number of mutants overtake a population that is structured on a weighted, possibly directed graph. Currently Monte Carlo simulations are used for estimating such fixation probabilities on directed graphs, since no good analytical methods exist. In this paper, we introduce a novel deterministic ...

Enough is enough.

Coinciding with the 50th anniversary of the first Surgeon General report on smoking and health (U.S. Department of Health, Education and Welfare, 1964) was the release of the 2014 Surgeon General report The Health Consequences of Smoking-50 Years of Progress (U.S. Department of Health and Human Services, 2014). During a press conference announcing the report in January 2014, Acting Surgeon Gene...